Test Strategy Generation Using Quantified CSPs

نویسندگان

  • Martin Sachenbacher
  • Paul Maier
چکیده

Testing is the process of stimulating a system with inputs in order to reveal hidden parts of the system state. We consider a variant of the testing problem that was put forward in the model-based diagnosis literature, and consists of finding input patterns that definitely discriminate between different constraint-based system models. We show that this problem can be framed as a game played between two opponents, and naturally lends itself towards a formulation in terms of quantified CSPs. This QCSP-based formulation is a starting point to extend testing to a new classes of practically relevant applications – namely, systems with limited controllability – where tests consist of stimulation strategies instead of simple input patterns.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Encoding Quantified CSPs as Quantified Boolean Formulae

Quantified Constraint Satisfaction Problems (QCSPs) are CSPs in which some variables are universally quantified. For each possible value of such variables, we have to find ways to set the remaining, existentially quantified, variables so that the constraints are all satisfied. Interest in this topic is increasing following recent advances in Quantified Boolean Formulae (QBFs), the analogous gen...

متن کامل

Algorithms for Quantified Constraint Satisfaction Problems

Many propagation and search algorithms have been developed for constraint satisfaction problems (CSPs). In a standard CSP all variables are existentially quantified. The CSP formalism can be extended to allow universally quantified variables, in which case the complexity of the basic reasoning tasks rises from NP-complete to PSPACE-complete. Such problems have, so far, been studied mainly in th...

متن کامل

Improving Genet and Egenet by New Variable Ordering Strategies

Constraint satisfaction problems (CSPs) naturally occur in a number of important industrial applications such as planning and scheduling defeating many algorithmic search methods. GENET and it extended model, EGENET, are probabilistic neural networks which had some remarkable success in solving some hard instances of CSPs such as a set of hard graph coloring problems. Both GENET or EGENET does ...

متن کامل

Using the Particle Swarm Optimization Algorithm to Generate the Minimum Test Suite in Covering Array with Uniform Strength

Up to now, several useful algorithms have been proposed to generate covering array, which is one of the branches of combinatorial testing. The main challenge in generating such arrays is generation of the arrays with a minimum number of test cases (for efficiency) at a proper time (for performance), for large systems. Covering array generation strategies are often divided into two general categ...

متن کامل

Using Interval Arithmetic To Model Finite Domain CSPs Where Domain Generation Is Expensive

It is generally assumed that the variables, domains and constraints of a Finite-Domain Constraint Satisfaction Problem are all pre-computed inputs to a black-box constraint satisfaction algorithm. The obvious advantages of such an assumption is the freedom in developing generic constraint solvers and the declarative use of constraint technology. However, it is useful to examine applications of ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008